翻訳と辞書 Words near each other ・ Anti-thrombin aptamers ・ Anti-thymocyte globulin ・ Anti-thyroid autoantibodies ・ Anti-Tiger ・ Anti-tobacco movement in Nazi Germany ・ Anti-Tom literature ・ Anti-topoisomerase antibodies ・ Anti-torpedo bulge ・ Anti-Trafficking in Persons Act of 2003 ・ Anti-transglutaminase antibodies ・ Anti-tromboning ・ Anti-Turkism ・ Anti-twister ・ Anti-twister mechanism ・ Anti-Ukrainian sentiment ・ Anti-unification (computer science) ・ Anti-union organizations in the United States ・ Anti-union violence ・ Anti-Urban ・ Anti-Urinal Law ・ Anti-Vaccination Society of America ・ Anti-VGKC-complex encephalitis ・ Anti-vibration compound ・ Anti-Victim ・ Anti-Vietnamese sentiment ・ Anti-Vivisection Coalition ・ Anti-WAAhnsinns Festival ・ Anti-War Coalition ・ Anti-War Committee ・ Anti-war movement Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Anti-unification (computer science) ： ウィキペディア英語版 Anti-unification (computer science) Anti-unification is the process of constructing a generalization common to two given symbolic expressions. As in unification, several frameworks are distinguished depending on which expressions (also called terms) are allowed, and which expressions are considered equal. If variables representing functions are allowed in an expression, the process is called higher-order anti-unification, otherwise first-order anti-unification. If the generalization is required to have an instance literally equal to each input expression, the process is called syntactical anti-unification, otherwise E-anti-unification, or anti-unification modulo theory. An anti-unification algorithm should compute for given expressions a complete, and minimal generalization set, that is, a set covering all generalizations, and containing no redundant members, respectively. Depending on the framework, a complete and minimal generalization set may have one, finitely many, or possibly infinitely many members, or may not exist at all;〔Complete generalization sets always exist, but it may be the case that every complete generalization set is non-minimal.〕 it cannot be empty, since a trivial generalization exists in any case. For first-order syntactical anti-unification, Gordon Plotkin gave an algorithm that computes a complete and minimal singleton generalization set containing the so-called least general generalization (lgg). Anti-unification should not be confused with ''dis-unification''. The latter means the process of solving systems of inequations, that is of finding values for the variables such that all given inequations are satisfied.〔Comon referred in 1986 to inequation-solving as "anti-unification", which nowadays has become quite unusual. 〕 This task is quite different from finding generalizations. ==Prerequisites== Formally, an anti-unification approach presupposes * An infinite set $V$ of variables. For higher-order anti-unification, it is convenient to choose $V$ disjoint from the set of lambda-term bound variables. * A set $T$ of terms such that $V\; \backslash subseteq\; T$. For first-order and higher-order anti-unification, $T$ is usually the set of first-order terms (terms built from variable and function symbols) and lambda terms (terms containing some higher-order variables), respectively. * An equivalence relation $\backslash equiv$ on $T$, indicating which terms are considered equal. For higher-order anti-unification, usually $t\; \backslash equiv\; u$ if $t$ and $u$ are alpha equivalent. For first-order E-anti-unification, $\backslash equiv$ reflects the background knowledge about certain function symbols; for example, if $\backslash oplus$ is considered commutative, $t\; \backslash equiv\; u$ if $u$ results from $t$ by swapping the arguments of $\backslash oplus$ at some (possibly all) occurrences.〔E.g. $a\; \backslash oplus\; (b\; \backslash oplus\; f(x))\; \backslash equiv\; a\; \backslash oplus\; (f(x)\; \backslash oplus\; b)\; \backslash equiv\; (b\; \backslash oplus\; f(x))\; \backslash oplus\; a\; \backslash equiv\; (f(x)\; \backslash oplus\; b)\; \backslash oplus\; a$〕 If there is no background knowledge at all, then only literally, or syntactically, identical terms are considered equal. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Anti-unification (computer science)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.